time-scale algorithm
We thank all the reviewers for their encouraging comments
We thank all the reviewers for their encouraging comments. In both these cases, τ is effectively zero. Liu et al. shows how GTD-class algorithms can be formally derived using a primal-dual saddle point Sutton et al. presents a (single time-scale) variant of linear TD learning, which they call emphatic TD and show that They also provide an asymptotic convergence analysis to the set of local optima. If the paper is accepted, we will work further on improving the clarity of the work.
Technology: Information Technology > Artificial Intelligence > Machine Learning > Reinforcement Learning (0.30)